Multi-Depot Split-Delivery Vehicle Routing Problem

The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, distribution centers strive for competitive efficiency operations minimize transportation costs. This study proposed mixed-integer programming (MIP) model multi-depot split-delivery vehicle routing problems (MDSDVRPs) with hetero vehicles, allowing visits a customer. A genetic algorithm (GA) novel two-dimensional chromosome representation has been dynamic mutation policies. process parameters GA are optimized using Taguchi method. algorithms showed benefits MDSDVRPs performance even classical single-depot no split-delivery.